Tutorial on VLSI Partitioning
نویسندگان
چکیده
The tutorial introduces the partitioning with applications to VLSI circuit designs. The problem formulations include two-way, multiway, and multi-level partitioning, partitioning with replication, and performance driven partitioning. We depict the models of multiple pin nets for the partitioning processes. To derive the optimum solutions, we describe the branch and bound method and the dynamic programming method for a special case of circuits. We also explain several heuristics including the group migration algorithms, network ̄ow approaches, programming methods, Lagrange multiplier methods, and clustering methods. We conclude the tutorial with research directions.
منابع مشابه
Multi Objective Inclined Planes System Optimization Algorithm for VLSI Circuit Partitioning
In this paper multi objective optimization problem for partitioning process of VLSI circuit optimization is solved using IPO algorithm. The methodology used in this paper is based upon the dynamic of sliding motion along a frictionless inclined plane. In this work, modules and elements of the circuit are divided into two smaller parts (components) in order to minimize the cutsize and area imbal...
متن کاملT3: Physical Design
Description: The objective of the tutorial is to survey recent algorithms and methodologies that have had (or are likely to have) a significant impact on the physical design industry. A second objective is to provide industrial feedback to the academic community in an effort to increase the relevance of academic research to industrial needs. Outline: Data Structures for VLSI, Partitioning, Floo...
متن کاملMulti-way partitioning of VLSI circuits
Partitioning is one of the critical phases of hierarchical design processes like VLSI design. Good partitioning techniques can positively in uence the performance and cost of a VLSI product. This paper proposes a partitioning algorithm with a new cost metric. Viewed from a VLSI layout point of view our cost metric minimizes the average delay per net. It can also be interpreted as achieving the ...
متن کاملPartitioning VLSI circuits on the basis of Genetic Algorithms and Comparative Analysis Of KL And SA Partitioning Algorithms
Circuit partitioning is the one of the fundamental problems in VLSI design. It appears in several stages in VLSI design, such as logic design and physical design. Circuit partitioning is generally formulated as the graph partitioning problem. Circuit partitioning problem is a well known NP hard problem. The potential of Genetic Algorithm has been used to solve many computationally intensive pro...
متن کاملPartitioning VLSI Circuits
Partitioning is a critical area of VLSI CAD. In order to build complex digital logic circuits it is often essential to sub-divide a circuit into smaller parts.Circuit partitioning plays an important role in physical design automation of very large scale integration(VLSI)chips.In VLSI.In VLSI circuit partitioning the problem of obtaining minimum cut is of prime importance.To enhance other criter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999